Arithmetic processor using signed digit representation of internal operands

ABSTRACT

This invention discloses an arithmetic processor which represents internal arithmetic operands as signed-digit numbers, each digit of which may have either positive, zero, or negative values and which executes addition of a plurality of numbers each of whose most significant digit is offset with respect to the other numbers. The arithmetic processor includes an adder tree which is so constituted that a pair of said plurality of numbers are added to obtain a partial sum and further pairs of partial sums are successively added to obtain a final sum of all numbers. The arithmetic processor further comprises first means for adding a portion of the two numbers where both digits are present, second means for causing a lower order portion where only one of the numbers has a digit present to directly become part of the sum, third means for retaining or outputting a carry created by the first means, and fourth means for adding the carry created in each add stage of the adder tree to the later add stages of the adder tree to obtain the sum.

RELATED APPLICATIONS

This is a continuation of copending application Ser. No. 199,318 filed on May 26, 1988, now abandoned, which in turn is a continuation-in-part of the following pending patent applications:

    __________________________________________________________________________     Serial No.                                                                           Filing Date                                                                              Title             U.S. Pat. No.                                __________________________________________________________________________     066,817                                                                              June 25, 1987                                                                            ARITHMETIC PROCESSOR                                                                             4,873,660                                    070,565                                                                              July 7, 1987                                                                             ARITHMETIC PROCESSOR AND                                                                         4,878,192                                                    ARITHMETIC UNIT THEREFOR                                       074,892                                                                              July 17, 1987                                                                            HIGH SPEED ARITHMETIC                                                                            4,866,655                                                    PROCESSOR                                                      074,971                                                                              July 17, 1987                                                                            HIGH SPEED ARITHMETIC                                                                            4,864,528                                                    PROCESSOR AND MULTIPLIER                                                       THEREOF                                                        086,967                                                                              August 18, 1987                                                                          ARITHMETIC PROCESSOR AND                                                                         4,866,657                                                    ADDER CIRCUITRY THEREOF                                        095,525                                                                              September 10, 1987                                                                       ARITHMETIC PROCESSOR                                                                             4,868,777                                    136,365                                                                              December 22, 1987                                                                        ARITHMETIC PROCESSOR                                                                             4,935,892                                    __________________________________________________________________________

The disclosures of each application referred to above are incorporated herein by reference.

BACKGROUND OF THE INVENTION

This invention relates to an arithmetic processor, and more particularly, to a high-speed arithmetic processor having a regular cellular array structure which is suitable for and easily implemented into large scale integration (LSI) circuit devices and which incorporates means for performing high speed calculations by using a redundant signed-digit number representation when performing internal arithmetic operations.

Conventionally, an arithmetic processor which adds a plurality of numbers whose most significant digits are different in position from each other comprises an adder tree, for example, using a carry-retaining adder which simultaneously adds three digits and obtains two calculated results as output, the thus-obtained results being further added to a next higher order digit in a similar manner for the purpose of obtaining a final sum. In many applications, two numbers are required to be added in a manner whereby the digits of the first number are offset from the digits of the second number. A common example is the addition of partial sums formed during a multiplication calculation. The digits of the two offset numbers may be considered to generally comprise three portions: a lower order portion, in which the lower order digits of one of the offset numbers are not overlapped by digits of the other number, an intermediate portion, in which there are digits of both numbers present, and a higher order portion in which higher order digits of only one number are present. In the prior art, addition of the two numbers is performed by making the lower order portion part of the sum, per se. The digits of the intermediate portion are added by standard methods. In the higher order portion, when either digits of only the first or the second number is present, the addition is performed by first extending the sign for negative numbers (which are represented in 2's complement binary form). Sign extension is necessary because the carry from the intermediate digits has to be properly considered.

In the above described prior art, in a case where digits of either the first number or the second number are not present in the higher order portion, it is necessary for the higher order portion to be added by sign extension. Therefore, an adder for this portion is additionally needed. Furthermore, when addition is performed on a plurality of numbers which have their most significant digits offset with respect to each other, a problem arises in that the regularity of the circuit can be lost since the sum is extended by one digit due to the carry from the most significant digit whenever an addition is performed.

SUMMARY OF THE INVENTION

It is an object of this invention to solve the above described problem and to provide an arithmetic processor in which an adder thereof is configured by a regular circuit structure which can be readily fabricated on an LSI chip, has a small hardware volume, and is capable of performing high speed addition using a signed-digit number representation for the internal calculation.

Another object of the present invention is to provide an arithmetic processor in which an arithmetic unit thereof can be realized in a small hardware volume, and which can be readily fabricated on an LSI chip, by utilizing the characteristics of the signed-digit number representation to perform the internal arithmetic operations.

A still further object of the present invention is to provide an arithmetic processor with a small hardware volume within which a high speed multiplier and a divider are independently configured, by utilizing signed-digit number representations in the internal arithmetic operations.

The above objects are realized in accordance with one aspect of the invention by using a signed-digit number representation in the internal arithmetic operation, (described for example by Algirdas Avizienis in IRE Transactions on Electronic Computers, pp. 389-400, Sept. 1961) and forming an adder tree comprising adder cells having first means for adding the intermediate overlapping portions of two numbers where the digits of both the first number and the second number are present, second means for including directly into the sum the lower order portion in which the offset lower-order digits of either the first or the second number are present, and third means for outputting the carry created by the first means; the adder tree adding each pair of a plurality of numbers expressed by signed-digit numbers, and successively adding the thus-obtained partial sums to obtain the final sum. Furthermore, fourth means are provided for adding the carries which are created in each of the above described adder stages of the adder tree to the ensuing adder stage. In each adder stage of the above described adder tree, the first to the fourth means are executed to obtain the sum.

The objects of the invention are further achieved by using specific encoding representations which may differ in binary format in accordance with the digit, wherein the digits of the internal arithmetic numbers of the arithmetic processor are expressed by encoding a plurality of bits.

Still further, in accordance with the invention, a multiplier and divider are formed and integrated on the same chip.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates the structure of an arithmetic processor according to an embodiment of this invention.

FIGS. 2 to 4 are drawings illustrating each step of the addition in the operation of the arithmetic shown in FIG. 1;

FIGS. 5 to 8 are schematic circuit diagrams illustrating an example of each redundant binary number adder cell for forming the arithmetic processor shown in FIG. 1.

FIG. 9 is a schematic circuit diagram showing the arithmetic processor actually formed by each of the redundant binary adder cells shown in FIGS. 5-8 for adding four redundant binary numbers;

FIG. 10 is a block diagram illustrating another embodiment of the invention for carrying out division;

FIG. 11 is a circuit diagram showing a partial quotient determining cell used in the divider shown in FIG. 10;

FIG. 12 is a circuit diagram of a cell for determining the digits of lower order than the fourth digit of the partial remainder used in the divider shown in FIG. 10;

FIG. 13 is a circuit diagram of a cell for determining the third most significant digit of the partial remainder used in the divider shown in FIG. 10;

FIG. 14 is a circuit diagram illustrating a cell for determining the second most significant digit of the partial remainder used in the divider shown in FIG. 10;

FIG. 15 is a circuit diagram of a cell for determining the most significant digit of the partial remainder used in the divider shown in FIG. 10; and

FIG. 16 is a block diagram of an arithmetic processor which integrates the multiplier and the divider according to an embodiment of this invention.

DETAILED DESCRIPTION OF THE INVENTION

With reference to the drawings, an embodiment of the present invention will now be described.

First, a signed-digit number representation and adding rule thereof will now be described.

In a case where a signed-digit number is used for an internal arithmetic operation, each digit of the numbers to be calculated is expressed by one of a series of elements such as {-1, 0, 1}, {-2, -1, 0, 1, 2}, and {-N, . . . , -1, 0, 1, . . . N}, in radix 2, 3, and N+1 respectively. The representation is redundant because it is possible to express a number in a multiplicity of different forms. In addition there are a plurality of encoding formats that are capable of expressing each of the elements of the sets. For example, in radix 2, each digit of the set {-1, 0, 1} can be expressed by encoding it in two bit binary signals, and can be expressed by using two suitable signals chosen from among a possible six signals I₊, I₀, I₋, I_(a), I_(s), I_(n) shown in Table 1.

                  TABLE 1                                                          ______________________________________                                         Signal For Representing Each Digit Of -1, -0, 1                                        Signal                                                                 Digit     I.sub.+                                                                              I.sub.0   I.sub.-                                                                            I.sub.n I.sub.a                                                                            I.sub.s                              ______________________________________                                         1         1     0         0   0       1   1                                    0         0     1         0   1       0   1                                    -1        0     0         1   1       1   0                                    ______________________________________                                    

In this encoding scheme, although I_(n) is the logical negation of I₊, I_(a) is the logical negation of I₀, and I_(s) is the logical negation of I₋, they are treated as different signals for the purpose of defining a numerical logic.

Each digit x_(i) of a redundant binary number to be added is represented by two single-bit binary values x_(is) and x_(ia) as shown, for example, in Table 2.

                  TABLE 2                                                          ______________________________________                                         x.sub.i           x.sub.is                                                                             x.sub.ia                                               ______________________________________                                         1                 0     1                                                      0                 0     0                                                      -1                1     1                                                      ______________________________________                                    

An example of the rule for addition of the redundant binary numbers is shown in Table 3 in which x_(i) and y_(i) are respectively an augend and an addend, c_(i) and s_(i) are respectively a carry and an internal sum, and p_(i) is derived from the sign of x_(i) and y_(i). If both are non-negative, p_(i) =1; if at least one of them is negative, p_(i) =0. The carry c_(i) and the internal sum s_(i) are determined to satisfy the arithmetic sum

    x.sub.i +y.sub.i =2c.sub.i +s.sub.i                        (1)

of the redundant binary number in accordance with the signs p_(i-1) of the two digits which are in the next lower order position of the two numbers. By utilizing this method, the carry propagation is limited to at most one digit, so that parallel addition of the digits can be conducted in a predetermined time period regardless of the number of digits. In this scheme, when parameters B_(i) and R_(i) are introduced, and determined in accordance with the arithmetic sum of the redundant binary numbers as follows,

    B.sub.i =c.sub.i +p.sub.i                                  (2)

    R.sub.i =s.sub.i +p.sub.i-1                                (3)

c_(i) and s_(i) can be converted to a binary signal {1,0}, whereby the amount of hardware volume required for a calculation can be reduced. In this state, p_(i) represents a signal which is the logical negation of p_(i).

                                      TABLE 3                                      __________________________________________________________________________     x.sub.i                                                                           y.sub.i                                                                            x.sub.i  + y.sub.i                                                                  p.sub.i                                                                           p.sub.i-1                                                                          c.sub.i                                                                            s.sub.i                                                                            B.sub.i R.sub.i  = s.sub.i  + p.sub.i-1             __________________________________________________________________________      1  1   2   1                                                                                  ##STR1##                                                                           1  0   1                                                                                       ##STR2##                                    1 0                                                                               0 1                                                                                1   1                                                                                  ##STR3##                                                                           ##STR4##                                                                           ##STR5##                                                                           ##STR6##                                                                               ##STR7##                                    ##STR8##                                                                          ##STR9##                                                                           0                                                                                   ##STR10##                                                                         ##STR11##                                                                          0  0                                                                                   ##STR12##                                                                              ##STR13##                                  -1  1                      1                                                   -1 0                                                                               0 -1                                                                              -1   0                                                                                  ##STR14##                                                                          ##STR15##                                                                          ##STR16##                                                                          ##STR17##                                                                              ##STR18##                                  -1 -1  -2   0                                                                                  ##STR19##                                                                         -1  0   0                                                                                       ##STR20##                                  __________________________________________________________________________

R_(i), B_(i) and p_(i) are, in accordance with the rule for addition shown in Table 3, represented by the following logical equation using binary signals x_(is), x_(ia), y_(is) and y_(ia) which respectively represent augend x_(i) and addend y_(i). ##EQU1##

In the logical equation, · is a logical product (AND), + is a logical sum (OR), x is a logical negation of x, and ⊕ is a logical operand showing an exclusive logical sum (EX-OR). The sum z_(i) of the first digits is obtained by an arithmetic equation,

    z.sub.i =s.sub.i +c.sub.i-1                                (7)

from the internal sum s_(i) and the carry c_(i-1) from the digit which is in the next lower order position. By rewriting this arithmetic equation using B_(i) and R_(i), ##EQU2## can be obtained. Furthermore, from the logical rule shown in Table 4, logical equations for the sum z_(i) can be obtained:

    z.sub.is =R.sub.i +B.sub.i-1                               (9)

    z.sub.ia =R.sub.i ⊕B.sub.i-1                           (10)

                  TABLE 4                                                          ______________________________________                                         R.sub.i   B.sub.i-1                                                                             z.sub.i       z.sub.is                                                                           z.sub.ia                                    ______________________________________                                         0         0      -1            1   1                                           0         1      0             0   0                                           1         0      0             0   0                                           1         1      1             0   1                                           ______________________________________                                    

Next, specific embodiments of the invention will be described.

In the first embodiment, an adding unit will be described which is a member of a multiplier, utilizing a redundant binary representation for its internal arithmetic operation, and which adds seven partial products each of which is offset with respect to the others by two digits.

FIG. 1 is a structural diagram of an adding unit to which an embodiment of the present invention is applied. In this embodiment, the above described rule for addition is used. In the addition of two numbers, the number whose most significant digit is located at a lower order position is called an augend, while the number whose most significant digit is positioned at the higher order position is called an addend.

Redundant binary output buffers 1, 2, 3, 4, 5, 6, and 7 are circuits for outputting or retaining the redundant binary numbers; these buffers may be formed by a register or a redundant binary adder.

Each of redundant binary adders 12, 14 and 16 is a circuit for adding the outputs from the redundant binary buffers 1 and 2, 3 and 4, and 5 and 6 in a redundant binary number system in accordance with the rule for addition shown in Table 3.

Carries 22, 24 and 26 are the carries which result from additions conducted by the redundant binary adders 12, 14, and 16. The carry 22 is included in the output of the redundant binary adder 12.

Redundant binary adders 120 and 140 are circuits for adding the outputs from the redundant adders 12 and 14 and the carry 24, and the outputs from the redundant binary adder 16 and the redundant binary buffer 7, respectively, the addition being conducted in accordance with the rule for addition shown in Table 3.

Carries 220 and 240 are the carries resulting from the addition conducted by the redundant binary adders 120 and 140. The carry 220 is included in the output of the redundant binary adder 120.

A redundant binary adder 160 is a circuit for adding the outputs from the redundant binary adders 120 and 140 and the carries 26 and 240 in a redundant binary number system in accordance with the rule for addition shown in Table 3.

A carry 260 is the carry resulted from the addition conducted by the redundant binary adder 160, and is included in the output of the redundant binary adder 160.

Outputs 9, 19, and 190 are respectively the portions of the digits which are output as is without being passed through the adders when an addition is conducted by the redundant binary adders 12, 120 and 160.

The details of this adding unit will now be described with reference to the model drawings shown in FIGS. 2 to 4. The binary numbers in these drawings are the same as the outputs from the redundant binary buffers, outputs from the redundant binary adders, and the carries, and are given the same reference numerals as shown in FIG. 1.

In FIG. 2, a first step of the addition is shown. The intermediate portion between the vertical lines represents the region for simultaneously adding two numbers of the redundant binary numbers in a redundant binary system. The number whose most significant digit is positioned at a lower order position is added by first entering 0's to the left of its most significant digit. In the example shown in FIG. 2 since the number whose most significant digit is positioned at a lower order position is the redundant binary number 1, the addition for obtaining the sum 12 of the redundant binary number 1 and 2 is conducted by entering 0's to the left of the most significant digit of the augend. The reason for this lies in the fact that if only the portion in which both digits are present are added by the above described first means, and a carry retained by the above-described third means, four numbers including the carry would need to be added in the ensuing additions to complete the sum. This would not be efficient. The carry 22 resulting from the addition, is located at the most significant digit of the sum 12, and is output by the third means. Since the portions shown by black dots need not be added later, they are per se discharged as an output to be made part of the final sum.

In obtaining the sums 14 and 16, which are respectively the sum of redundant binary numbers 3 and 4, and 5 and 6, the additions for the intermediate digits where both the augend and addend digits are present are conducted by the above-described first means. In the higher order portions where the augend digits in the underlined section are not present, the addends are per se made the sum by the second means of entering 0's to the left of the highest order digit and then performing an addition. The carries 24 and 26 produced by the addition of the intermediate digits are added by the above described fourth means after they have been output. The lower order digits designated by the underlined sections are also per se made part of the final sum.

FIG. 3 shows a next step. In these redundant binary numbers, since the number whose most significant digit is at the lowest order position is 12, the addition of 12 and 14 and carry 24 resulting from the addition for obtaining 14 are conducted by the above described first means by entering 0's to the upper digits, and by the above-described fourth means in which the carries are added. The resultant sum 120 and the carry which is located at the most significant digit and output by the third means is 220. The portions designated by black dots are per se delivered as outputs to form part of the final sum. The addition of 16 and the residual number 7 in the previous step are conducted by the above-described first, second, third and fourth means. Reference numeral 140 represents a resultant sum, reference numeral 240 represents a carry created from this addition. The portions designated by underlined sections are the portions which are per se made the sum from the upper digits and lower digits.

FIG. 4 shows the final step. Since the number which has its most significant digit located at the lowest order position is 120, a sum 160 is obtained from 120, 140 and carries 26 and 240 by the above described first and fourth means. Reference numeral 260 is a carry which is located at the highest order position of the sum, and output by the third means.

Since the redundant binary adder which is used in these additions adds the carries by the fourth means in the next and ensuing stages, the sum does not extend by one digit whenever an addition is conducted as shown in FIG. 1, and a regular circuit can be constituted.

Circuits forming each block shown in FIG. 1 will now be described.

FIG. 5 is an example of a schematic circuit diagram obtained from equations (4), (5), (6), (9), (10), and shows an adder cell forming the parts of the redundant binary adders 12, 120, and 160 and 14. 16, and 160 shown in FIG. 1. Signals x_(is) 501 and x_(ia) 502 are two single bit binary signals representing the i-th digit x_(i) of the augend redundant binary number, y_(is) 503 and y_(ia) 504 are two bit single-binary signals representing the i-th digit of the addend redundant binary number, and p_(i-1) 505 is a signal representing whether both the augend x_(i-1) and the addend y_(i-1) at the (i-1)th digit position are non-negative. B_(i-1) is a signal which is the logical negation of the arithmetic sum B_(i-1) of the carry c_(i-1) which is created by the addition of the (i-1)th digit and the negation P_(i-1) of the above described p_(i-1) 505. z_(is) 520 and z_(ia) 521 are two bit signals each of which shows the output z_(i) of the result of the (i)th digit. p_(i) 522 is a signal representing whether both the augend x_(i) and the addend y_(i) are non negative. B_(i) 523 is a signal which negates the arithmetic sum B_(i) of the carry c_(i) created from the addition of the i-th digit and the logical negation p_(i) of the above-described p_(i) 522. A two-input-NOR gate 510, two input-NAND gates 511, 515, two-input exclusive OR gate 512, three input and two-input AND-NOR complex gate 513, two-input exclusive NOR gate 514, two-input and one-input OR-NAND complex gate 5-6, and inverter 517 are logical gates forming the adder cell shown in FIG. 5.

Next, a circuit will be described for adding a redundant binary number and 0, in each stage of an adder tree, for the case where a number whose most significant digit is located at a lower order position is to be added to an adjacent number having its most significant digit at a higher order position. In the above-described equations (1) to (10). assuming that the augend x_(i) =0, that is, x_(is) =x_(ia) =0, the logical equations in this case are reduced to the following:

    p.sub.i =y.sub.is                                          (11)

    B.sub.i =y.sub.ia ·p.sub.i-1                      (12) ##EQU3##

FIG. 6 shows a schematic example of a circuit of an adder cell forming the parts of the redundant binary adders 12, 120, and 160 shown in FIG. 1, and obtained from the logical equations (9) to (13). Signals y_(is) 601 and y_(ia) 602 are two bit signals each represents the (i)th digit of the addend redundant binary number. p_(i-1) 603 is a signal showing whether the augend y_(i-1) is non-negative in a case where the augend x_(i-1) or the addend y_(i-1) or x_(i-1) is 0. B_(i-1) 604 is a signal which is the logical negation of the arithmetic sum B_(i) 1 of the carry c_(i-1) caused from the addition of the (i-1)th digit and the logical negation p_(i-1) of the above-described p_(i-1) 603. z_(is) 620 and z_(is) 621 are two-bit signals showing the output z_(i) as a result of the addition of the (i)th digit. p_(i) 622 is a signal showing whether y_(i) is non negative. B_(i) 623 is a signal which is a logical negation of the arithmetic sum B_(i) of the carry c_(i) caused from the addition of the i-th digit and the logical negation p_(i) of 622. Inverters 610, 615, two input NAND gates 611 and 613, and two input and 1-input OR-NAND-gates 612 and 614 are the logical gates forming the adder cell shown in FIG. 6.

Next, a circuit will be described which is used in the most significant digit of the redundant binary adder which adds the number whose most significant digit is positioned at the lower order position and the adjacent number whose most significant digit is at higher order position, and which makes the carry from the adjacent digit which is in the next lower order position the sum per se.

In the above-described logical equations (1) to (10), assuming that x_(i) =y_(i) =0, that is x_(ia) =x_(is) =y_(ia) =y_(is) =0, the following equation can be obtained:

    z.sub.is =p.sub.i-1 +B.sub.i-1                             (14)

    z.sub.ia =p.sub.i-1 ⊕B.sub.i-1                         (15)

FIG. 7 is an example of a schematic circuit diagram showing an adder cell in which the carries 22, 220, and 260 are per se made the sum in the redundant binary adders 12, 120, and 160 shown in FIG. 1. p_(i-1) 701 is a signal representing the sign of the addend y_(i-1) at the (i-1)th digit (one digit lower). B_(i-1) 702 is a signal which logically negates the arithmetic sum B_(i-1) of the carry c_(i-1) and the logical negation p_(i-1) of the above-described p_(i-1) 701. z_(is) 720 and z_(ia) 721 are two-bit signals showing the output z_(i) of the result of the addition of the i-th digit. Inverters 710 and 713, two-input-NAND gate 711, and two-input and one-input-OR-NAND combined gate 712 are the logical gates forming this adder cell.

Next, a circuit used for the lowest order digit of each redundant binary adder will now be described. In this lowest order digit, any carry from an even lower order digit of the adder need not be considered. Therefore, assuming that p_(i-1) =B_(i-1) =0, the following equations can be obtained from the logical equations (4), (5), and (6).

    p.sub.i =x.sub.is +y.sub.is                                (16)

    B.sub.i =x.sub.ia ·y.sub.ia ·x.sub.is ·y.sub.is( 17)

    R.sub.i =x.sub.ia ⊕y.sub.ia                            (18)

Furthermore, from equations (9) and (10), the sum z_(i) is obtained as:

    z.sub.is =0                                                (19)

    z.sub.ia =R.sub.i                                          (20)

FIG. 8 is an example of a schematic circuit diagram showing an adder cell forming parts of the redundant binary adders 12, 14, 16, 120, 140, and 160 shown in FIG. 1.

Signals x_(is) 801 and x_(ia) 802 are two single-bit binary signals which represent the i-th digit x_(i) which is the lowest order digit of the augend redundant binary number. y_(is) 803 and y_(ia) 804 are two single-bit binary signals which represent the (i)th digit y_(i) of the addend redundant binary number. z_(is) 820 and z_(ia) 821 are two-bit signals showing the output z_(i) which is the result of the addition of the two digits. p_(i) 822 is a signal showing whether both the augend x_(i) and addend y_(i) are non-negative. B_(i) 823 is a signal which logically negates the arithmetic sum B_(i) of the carry c_(i) which is created from the addition of the lowest order digits and the logical negation p_(i) of the above described p_(i) 822. Two input NOR gate 810, two input NAND gate 811, three input NAND gate 813, and two-input exclusive-OR gate 814 are logical gates forming the adder cell shown in FIG. 8.

Finally, an example of a circuit for an adder unit which embodies an arithmetic processor according to an object of this invention, and which makes use of the adder cell configurations shown in FIG. 5, 6, 7 and 8 is shown in FIG. 9. In this example, an adder circuit is shown for adding four redundant binary numbers which are offset by two digits with respect to each other.

Redundant binary number output cell 900 is a cell which forms part of the redundant binary output buffers 910, 912, 914, and 916, and outputs the redundant binary numbers as a two bit binary signal. It can be realized by a flip flop, latch, and redundant binary buffer. A redundant binary adder cell 902 is an adder cell of the type shown in FIG. 5, which adds two redundant binary numbers and the carry from the lower order digit, outputs the redundant binary number which is the result of the addition as a two bit binary signal, and outputs the above-described binary signal p_(i) and Bi to a redundant binary adder cell which is one digit higher in order.

A redundant binary adder cell 904 is an adder cell of the type shown in FIG. 6, which adds a redundant binary number and 0 and the carry of the lower digit, and which outputs the redundant binary number which is the result of the addition as a two bit binary signal, and outputs the above-described binary signal p_(i) and B_(i) to the redundant binary adder cell which is one digit higher in order.

A redundant binary adder cell 906 is an adder cell of the type shown in FIG. 7, which makes the carry from the next lower order digit per se the sum, and outputs its redundant binary number as a two-bit binary signal. A redundant binary adder cell 908 is an adder cell shown in FIG. 8, which adds two redundant binary numbers and outputs the redundant binary number which is the result of the addition (as a two-bit binary signal) and above described binary signals p_(i) and B_(i) to the redundant binary adder cell which is one digit higher in order.

A redundant binary adder 920 is formed by the redundant binary adder cells 902, 904, 906 and 908, and adds outputs from the redundant binary buffers 910 and 912 to obtain a partial sum. The lower two digits of the outputs from the redundant binary buffers 910 and 920 are per se output, and become parts of the final sum. A redundant binary adder 922 is formed by redundant binary adder cells 902 and 908, and adds the outputs from the redundant binary buffers 914 and 916 to obtain a second partial sum. A redundant binary adder 922 is formed by redundant binary adder cells 902 and 908, and adds the outputs from the redundant binary buffers 914 and 916. A redundant binary adder 930 is formed by redundant binary adder cells 902, 904, 906, 908, and adds the outputs of the upper two bits of the redundant buffers 916 and the outputs of redundant binary buffers 920 and 922. The output from the redundant binary buffer 930 and the outputs of the two lower order digits of the above-described redundant binary buffer 910 and the redundant binary adder 920 are the sum of the four redundant binary numbers of eight digits, each of which is shifted two digits with respect to its adjacent number. The output of each digit is represented by a two-bit binary signal.

According to this embodiment, the additions are formed in a two-branch manner and are mainly conducted in the portion where both the augend and addend are present, with the resultant carries being either retained or output and added in the ensuing additions. As a result, the number of adder cells can be reduced in comparison to that required in the conventional art, high-speed operation can be realized, and a regular circuit architecture can be constituted.

Since the number of adder cells can be reduced by the above described operations, the hardware volume can be decreased, the arithmetic processor can be operated at high speed, the circuits can be regularly constituted, and the arithmetic processor can be easily and economically realized by means of large scale integration (LSI). The above defined embodiment is therefore of great practical value.

Next, an embodiment of the present invention which relates to an optimized encoding representation of signed-digit numbers will now be described. In the first embodiment, only one particular binary format is used to encode each digit of a redundant binary number. However, alternate binary format, such as shown in Table 5, may be used to optimize the encoding logic.

                  TABLE 5                                                          ______________________________________                                         Different Formats for Logical Representation Of {-1, 0, 1}                     I.sub.+  1.sub.-         I.sub.a                                                                              I.sub.s     I.sub.o                                                                            I.sub.n                         ______________________________________                                         1      1     0       1     1     1   1       0   0                             0      0     0       0     0     1   0       1   1                             -1     0     l       -1    1     0   -1      0   1                             ______________________________________                                    

By suitably selecting from the above plurality of binary formats for the digits of redundant binary members, a format which is chosen in accordance with the calculation requirements of a particular digit, the volume of the hardware can be significantly reduced and the arithmetic processing can be conducted at high speed. Specifically, this embodiment will describe a case in which a shift subtracting divider is used to perform divisions of n digit normalized signless binary decimals utilizing a redundant binary representation for the internal arithmetic operation, and wherein a different encoding representation is used for the three higher order digits than for the fourth and following digits of the partial remainder which is used to determine a digit of the quotient.

The shift subtracting division method is generally represented by the following recursion formula.

    R.sup.(j-1) =r×R.sup.(j) -q.sub.j ×D for j=0, 1, . . . , n-1(21)

In this equation, j represents an index of the recursion formula, r represents a radix, D represents a divisor, q_(j) represents the j-th quotient digit below the decimal point, r×R.sup.(j) represents a partial dividend before determination of q_(j), and R.sup.(j+1) represents a partial remainder after determination of q_(j). Therefore, a cell for determining the quotient q_(j) for each index of the recursion formula and a cell for determining each digit of the partial remainder R.sup.(j+1) are necessary to realize the requisite complex circuit.

FIG. 10 is a block diagram illustrating the structure of a device according to an embodiment of the present invention. Blocks and 1141 are partial quotient determining cells, blocks 1102 to 1106, and 1142 to 1146 are partial remainder determining cells. Signals y₁ 991, y₂ 992, and y₃ 993 are respectively the first, second and third decimal points of the divisor D which has been formalized as 0.y₁ y₂ y₃, . . . , y_(n). Signals q_(j+) 1111 and q_(j-) 1112 are negation signals of the two-bit signals q_(j+) and q_(j-) showing the quotient q_(j) of the j-th decimal point. Signals r₀₊ ^(j) 1121 and r₀₋ _(j) 1122 are the signal and the logical negation signal, respectively, representing the uppermost digit of the partial remainder R(j), r₁₊ ^(j) 1123 and r₁₋ ^(j) 1124 are the same for the second digit, r₂₊ ^(j) 1125, r₂₋ ^(j) 1126, and r_(2a) ^(j) 1227 are the same for third digit. r_(3a) ^(j) 1128 and r_(3s) ^(j) 1129 are the same for the fourth digit, r_(4a) ^(j) 1130 and r_(4s) ^(j) 1131 are the same for the fifth digit. Signals r₀₊ ^(j+1) 1151, r₀₋ ^(j+1) 1152, r₁₊ ^(j+1) 1153, r₁₋ ^(j+1) 1154, r₂₊ ^(j+1) 1155, r₂₋ ^(j+1) 1156, r_(2a) ^(j+1) 1157, r_(3a) ^(j+1) 1158, r_(3s) ^(j+1) 1159, r_(4a) ^(j+1) 1160, and r_(4s) ^(j+1) 1161 are, in a similar manner to the signals 1121 to 1131, signals representing the five higher its of the partial remainder R.sup.(j+1). The encoding format of the above described signals are shown in Table 6.

                  TABLE 6                                                          ______________________________________                                         Logical Representation Of Different Formats                                    For Signals q and r                                                            q       q.sub.+ q.sub.-                                                                              r       r.sub.+                                                                            r.sub.-                                                                              r.sub.a                                                                            r.sub.s                            ______________________________________                                         1       1       0     1       1   0     1   1                                  0       0       0     0       0   0     0   1                                  -1      0       1     -1      0   1     1   0                                  ______________________________________                                    

In this embodiment, since the radix r=2, equation (21) becomes

    R.sup.(j+1) =2×R.sup.(j) -q.sub.j ×D           (22)

Therefore, the quotient is determined to satisfy the following condition:

    |R.sup.(j+1) |<D                         (23)

From this condition, the quotient q_(j) is, in accordance with the value of the three most significant digits [r₀ ^(j) ·r_(i) ^(j) r₂ ^(j) ]_(SD2) of the partial remainder R.sup.(j), determined as follows: ##EQU4##

Where [ ]_(SD2) shows the signed digit redundant binary representation in radix 2. Using the two-bit signals q_(j+) and q_(j-) to represent each element of {-1, 0, 1}, the following logical equations can be easily determined.

    q.sub.j+ =r.sub.0+.sup.j +r.sub.0-.sup.j ·(r.sub.1+.sup.j +r.sub.1-.sup.j r.sub.2+.sup.j)                           (25)

    q.sub.j- =r.sub.0-.sup.j +r.sub.0+.sup.j ·(r.sub.1-.sup.j +r.sub.1+.sup.j r.sub.2-.sup.j)                           (26)

In the above-described equations, · represents a logical product (AND), + represents a logical sum (OR), r₀₊ ^(j), r₀₋ ^(j), r₁₊ ^(j), and r₁₋ ^(j), each represents a logical negation of r₀₊ ^(j), r₀₋ ^(j), r₁₊ ^(j), r₁₋ ^(j). Furthermore, although r₀₋ ^(j) =r_(0s) ^(j), and r₁₋ ^(j) =r_(ls) ^(j), these signals are treated as discrete parameters in the logical equations. FIG. 11 is a circuit diagram showing a structural example of the partial quotient determining cells 1101 and 1141. In this drawing, gates 1211 and 1222 are AND-NOR complex gates, 1212, 1221 are OR-NAND complex gates, and 1231 is an inverter circuit.

The partial remainder R.sup.(j+1) after determining the quotient q_(j) is determined by the following recursion formula:

    R.sup.(j+1) =2×R.sup.(j) +D.sup.(j)                  (27) ##EQU5##

Here, 1 represents -1 and y_(i) represents a logical negation of y_(i). This utilizes the fact that the sign negation of [0.y₁ y₂. . . y_(n) ]₂ can be conducted by obtaining a 2's complement binary number. Furthermore, 2×R.sup.(j) can be obtained by shifting R.sup.(j) left by one digit. However, [. . . ]₂ represents a binary representation.

In addition to the above-described redundant binary numbers and binary numbers, the internal carry and the internal sum are determined in accordance with the rule shown in Table 7.

                  TABLE 7                                                          ______________________________________                                         A Law Of Calculation Of A Redundant Binary Number (augend)                     With A Binary Number (addend)                                                  augend  addend    internal carry (c)                                                                          internal sum (s)                                ______________________________________                                         1       1         1            0                                               1       0         1            -1                                              0       1         1            -1                                              0       0         0            0                                               -1      1         0            0                                               -1      0         0            -1                                              ______________________________________                                    

As a result of this, the carry calculation can be arranged to propagate no more than one digit, and parallel addition by a combined circuit can be performed within a predetermined time period regardless of the number of digits of the number to be operated upon. The additions of redundant binary numbers and binary numbers are conducted hereinafter in accordance with the above described law of calculation.

In this state, the first digit d_(i) ^(j), internal carry c_(i) ^(j), and internal sum s_(i) ^(j) of the above described recursion formula (27) can be determined by the following logical equations.

    d.sub.i.sup.j =q.sub.j+ y.sub.i +q.sub.j- y.sub.i          (29)

    s.sub.i.sup.j =r.sub.i+1a.sup.j ⊕d.sub.i.sup.j         (30)

    c.sub.i.sup.j =r.sub.i+1s.sup.j ·(r.sub.i+1a.sup.j +d.sub.i.sup.j)(31)

Furthermore, the final sum r_(i) ^(j+1) can be given as a two-bit signal represented by

    r.sub.is.sup.j+1 =s.sub.i.sup.j +c.sub.i+1.sup.j           (32)

    r.sub.ia.sup.j+1 =s.sub.i.sup.j ⊕c.sub.i+1.sup.j       (33)

In these equations, ⊕ represents an exclusive logical sum (EX-OR). The simple equations, eq.(32) and (33), and the simple structure of a circuit to determine s_(i) and c_(i) can be obtained by using the above-described two-bit signals r_(a) and r_(s). However if the signals r₊ and r₋ are used, which are similar to those used in a case where the quotient is determined, the following equations can be obtained, whereby the number of transistors and the number of stages of gates required to determine s_(i) are increased:

    s.sub.i.sup.j =(r.sub.i+1+.sub.j +r.sub.i+1-.sup.j)⊕d.sub.i.sup.j(34)

    c.sub.i.sup.j =r.sub.i+1+.sup.j +r.sub.i+1-.sup.j ·d.sub.i.sup.j(35)

    r.sub.i+.sup.j+1 =s.sub.i.sup.j c.sub.i.sup.j              (36)

    r.sub.i-.sup.j+1 =s.sub.i.sup.j ·c.sub.i.sup.j    (37)

Therefore, the structure of a circuit to determine s_(i) and c_(i) can be simplified by using the binary format of r_(a) and r_(s).

FIG. 12 is a circuit diagram illustrating a structural example of the partial remainder determining cells 1105, 1106, . . . , and 1145, 1146, . . . the partial remainder being lower than the fourth digit shown in FIG. 10. In this figure, gates 1311, 1321, and 1351 are OR-NAND complex gates, 1322 is an exclusive OR gate, and 1341 is a NAND gate. r_(i+1s) ^(j) 1301 and r_(i+1a) ^(j) 1302 are two-bit signals representing the partial remainder r_(i+1) ^(j), y_(i) 1303 is a divider of the i-th decimal point, y_(i) is a negation signal of the former, c_(i) ^(j) 1331 is a negation signal of the carry c_(i) ^(j) to the higher order digit, c_(i+1) ^(j) 1332 is a negation signal of the carry c_(i+1) ^(j) from the lower order digit, d_(i) ^(j) 1312 is a one-bit signal representing the internal sum at the i-th decimal point, s_(i) ^(j) 1323 is a one-bit signal representing the internal sum at the i-th decimal point. Furthermore, r_(is) ^(j+1) 1361 and r_(ia) ^(j+1) 1362 are two-bit signals representing the i-th decimal point r_(i) ^(j+1) of the partial remainder after the quotient q_(j) has been determined.

FIG. 13 is a circuit diagram illustrating a structural example of the third digit of the partial remainder determining cells 1104 and 1144. The third digit of the partial remainder is represented by two encoding formats using two-bit signals r₂₊ ^(j+1) 1155 and r₂₋ ^(j+1) 1156 or r₂₋ ^(j+1) 1156 and r_(2a) ^(j+1) 1157. However, r₂₋ ^(j+1) is a similar signal to r_(2s) ^(j+1). The first binary format is used to determine the next state quotient and the uppermost digit of the partial remainder r₀ ^(j+2), and the second binary format is used to determine the second digit r₁ ^(j+2) of the next state partial remainder. However, in order to simplify the circuit structure in this embodiment, only one two-bit signal r_(2a) ^(j+1) is used to determine the second digit of the partial remainder. r₂₊ ^(j+1) and r₂₋ ^(j+1) can be determined by the following logical equations.

    r.sub.2+.sup.j+1 =s.sub.2.sup.j ·c.sub.3.sup.j    (38)

    r.sub.2-.sup.j+1 =s.sub.2.sup.j ·c.sub.3.sup.j    (39)

In this place, s₂ ^(j) is an internal sum determined by the equation (30), and c₃ ^(j) is an internal carry determined by the equation (31). In this figure, gates 1411, 1421, 1422, 1442 and 1451 are the same as those shown in FIG. 3, and gate 1441 is a NOR gate.

Furthermore, the two-bit signal representing the second digit of the partial remainder is determined by the local equations (40) and (41).

    r.sub.1+.sup.j+1 =(q.sub.j- ⊕r.sub.2a.sup.j)·c.sub.2.sup.j(40)

    r.sub.1-.sup.j+1 =(q.sub.j- ⊕r.sub.2a.sup.j)·c.sub.2.sup.j(41)

FIG. 14 is a circuit diagram showing a structural example of the cells 1103 and 1143 for determining the second digit of the partial remainder shown in FIG. 10. In this figure, a gate 1511 is an exclusive NOR gate, 1521 is a NOR gate, and 1522 is a NAND gate.

The highest order digit r₀ ^(j+1) of the partial remainder R.sup.(j+1) is, in a manner similar to the quotient, determined by the following equations in such a manner that the digits thereof do not extend to the upper digits from the upper three digits [r₀ ^(j) ·r₁ ^(j) r₂ ^(j) ]_(SD2) of the partial remainder R.sup.(j) :

    r.sub.0+.sup.j+1 =r.sub.0+.sup.j (r.sub.l-.sup.j +r.sub.2+.sup.j)+r.sub.0-.sup.j r.sub.1+.sup.j +r.sub.2+.sup.j(42)

    r.sub.0-.sup.j+1 =r.sub.0-.sup.j (r.sub.1+.sup.j +r.sub.2-.sup.j)+r.sub.0+.sup.j r.sub.1-.sup.j -r.sub.2-.sup.j(43)

FIG. 15 is a circuit diagram illustrating a structural example of cells 1102 and 1142 for determining the higher order digit of the partial remainder. In this figure, gates 1601 and 1604 are NOR gates, 1602 and 1603 are NAND gates, 1611 is an OR-NAND gate, 161 is an AND-NOR gate, and 1621 and 1622 are inverters.

In the above-described second embodiment, with the use of the different binary encoding formats to represent the three higher order digits of the partial remainder used for determining a digit of a quotient, and the following digits, the number of stages of gates required in the corresponding circuit can be reduced, whereby division can be conducted at higher speed.

Thus, in an arithmetic processor using signed-digit representation for the internal arithmetic operation, the use of a suitable binary encoding format chosen in accordance with the digits, to represent each digit of a number to be operated upon, permits the number of devices to be reduced, whereby the operations can be conducted at higher speeds.

Finally, an embodiment will now be described in which a multiplier and a divider are formed from individual circuit components. Specifically, in this embodiment, an example of an arithmetic processor will be described, which treats single-precision normalized floating-point numbers, in the format regulated by the IEEE Standard for Binary Floating-Point Arithmetic (ANSI/IEEE Std 754-1985).

First, the single precision normalized floating-point number format regulated by the IEEE 754 Standard and a floating point multiplier and a floating-point divider will be described. The single-precision normalized floating point number format regulated by the IEEE 754 Standard can be expressed by the following equation:

    (-1).sup.s ·2.sup.e-127 ·(1·f)  (44)

In the equation (44), symbol s represents a sign bit, e represents an 8-bit exponent which is displaced in the positive direction by 127, and f represents a 23 bit mantissa.

First, multiplication is considered. Assuming that a multiplicand X and a multiplier Y are

    X=(-1).sup.s.sbsp.x 2.sup.e.sbsp.x.sup.-127 (1·f.sub.X)(45)

    Y=(-1).sup.s.sbsp.x 2.sup.e.sbsp.y.sup.-127 (1·f.sub.Y)(46).

a product P can be expressed by the following equation. ##EQU6##

Therefore, the structure of the multiplier can be realized by, for example, a sign-determining circuit for determining the sign bit s_(p), an exponent adder for determining the exponent e_(p), and a mantissa determinator for determining the mantissa f_(p). The major portion of the mantissa determinator is an adder tree which adds the partial products, and this tree can be realized by an adder unit which uses redundant binary numbers for the internal operations number shown in the first embodiment.

Next, division will be considered. Assuming that the dividend is X, and divider is Y, each equation can be expressed by (45) and (46), the quotient Q can be expressed by the following equation. ##EQU7##

The structure of the divider can be realized, for example, by a sign determinator for determining sign bit s_(q), an exponent adder for determining the exponent e_(q), and a mantissa adder for determining the mantissa f_(q). The major portion of the mantissa determinator can be formed by the shift subtracting divider shown in a previous embodiment.

FIG. 16 is a structural view illustrating an arithmetic processor which is embodied by the present invention. Reference numeral 1701 represents a floating point multiplier, reference numeral 1711 represents a multiplicand x_(p), reference numeral 1712 represents a multiplier y_(p), and reference number 1713 represents a product P. The floating-point multiplier 1701 according to this embodiment is formed as follows; reference numeral 1702 represents a sign-determinator, reference numeral 1703 represents an adder for adding the exponent of x_(p) 1711 and the exponent of y_(p) 1712. Reference numeral 1704 represents an adder for adding the output from the adder 1703 with -127 for correcting the displacement of the exponent and the carrying signal for normalizing the mantissa. Reference numeral 1705 represents a mantissa determinator, reference number 1706 represents a partial product generator which is a component of the mantissa determinator 1705. Reference number 1701 represents a partial product adder circuit for adding the partial products, the partial product adder circuit being a component of the mantissa determinator 1705. Reference numeral 1708 represents a conversion circuit for converting the product to a binary numeral, the product being originally obtained in the form of a redundant binary number. As is well known, the partial products are set off by a one bit digit, and the partial product adder circuit can be formed by the adder unit shown in the first embodiment. Reference numeral 1721 represents a floating-point divider, reference numeral 1731 represents a dividend x_(q), reference numeral 1732 represents a divider y_(q), and reference numeral 1733 represents a quotient Q. The floating-point divider 1721 according to this embodiment is formed as follows; reference numeral 1722 represents a sign determinator, reference numeral 1723 represents a subtractor for subtracting an exponent of y_(q) 1732 from the exponent of X_(q) 1731. Reference numeral 1724 represents an adder for adding 127 for correcting the displacement between the output from the subtractor 1723 and the exponent and a digit-borrowing signal for normalizing the mantissa. Reference numeral 1725 represents a mantissa determinator, reference numeral 1726 represents a partial remainder determinator which forms the mantissa determinator 1725. Reference numeral 1728 represents a conversion circuit for converting the quotient to a binary numbers, the quotient being obtained in the form of a redundant binary number, and the conversion circuit forming the mantissa determinator 1725. The quotient determinator 1726 and the mantissa determinator 1727 can be formed by the shift subtracting divider shown above. Reference numeral 1750 represents a register for retaining data, the register reading the multiplicand x_(p) 1711 and the multiplier y_(p) 1712 and supplying the same to the floating-point multiplier 1701, and receiving and writing the obtained product P 1713. The register 1750 also reads the dividend x_(q) 1731 and the divider y_(q) 1732 and supplies the same to the floating-point divider 1721, and receives and writes the obtained quotient Q 1733. This can be realized by a multiport register of multi-input and multi-output type. By reading and writing a plurality of arithmetic operands wit the use of this register file 1750, the floating-point multiplier 1701 and the floating-point divider 1721 which are formed by individual hardware components can be operated in parallel. Although the floating-point multiplier and the floating-point divider are shown in this embodiment, it is apparent that a multiplier and a divider which uses as the arithmetic operands integers or fixed point numbers can be readily realized by each mantissa determinator shown in this embodiment.

Accordingly to this embodiment, significant advantages can be obtained, these advantages being that a high-speed multiplier and divider can be formed by the individual hardware elements, multiplication and division can be operated in parallel, and the volume of circuitry hardware can be reduced by using the adder unit disclosed herein and the shift subtracting divider disclosed herein in the internal arithmetic operations units.

Although the above-described embodiments realize the invention by a binary logic consistent with MOS circuit design other circuit technologies (for example NMOS, ECL, TTL, and IIL) or a higher radix logic may be utilized to realize the same objects of the invention. The exclusive OR and NOR gates shown in the embodimnets may be realized by a combination of complex gates and NAND or NOR gates, and it may be realized by 6-transistors using a transfer gate. Furthermore, it is also well known in the art that a NAND gate which is combined with an inverter can be readily used to replace a NOR gate and that a complex gate can be also readily be formed by combination of NAND or NOR gates.

Thus, many variations and modifications, and other embodiments of the invention described herein will be apparent to one skilled in the art. The scope of the invention described herein is not limited to the particular embodiments which have been described, but rather extends to include all other embodiments and modifications apparent to one skilled in the art. 

What is claimed is:
 1. An arithmetic processor comprising an adder tree for generating a final sum of a plurality of numbers, each of which is internally represented as a signed-digit number, said adder tree having a plurality of intermediate adder stages and a final adder stage, each adder stage having one or more adders for adding an augend and an addend pair, each pair being one of said plurality of numbers or a partial sum obtained as the result of an addition in a preceding intermediate adder stage, said augend and addend pair having an overlapping portion wherein the digits of said augend overlap digits of said addend and a non-overlapping portion caused by the augend being offset with respect to said addend, said intermediate adder stages of said adder tree including:a) one or more first type adders each having first type logic circuitry for adding the digits of said augend and addend in said overlapping portion to generate part of said partial sum for application to an adder in a subsequent adder stage, generating a carry resulting from the addition of the highest order digits of said overlapping portion, and directly applying all of the higher order digits forming the non-overlapping portion to said subsequent adder stage to form part of the partial sum therein; and b) a second type adder including second type logic circuitry for adding the digits of said augend and addend in said overlapping portion to generate part of said partial sum for application to an adder in a subsequent adder stage, generating a carry resulting from the addition of the highest order digits of said overlapping portion, and adding zeros placed in the non-overlapping portions of the augend and any carries output from said first type adders of a preceding stage to said higher order digits of said addend.
 2. An arithmetic processor utilizing signed-digit internal operands for determining a quotient resulting from division of a dividend by a divisor by generating a plurality of successive partial remainders R(j), each of said successive partial remainders and digits of said quotient being denoted by an index j, each digit of said signed-digit internal operands capable of being represented by binary signals chosen in accordance with a plurality of encoding rules, said arithmetic processor comprising:a) quotient determining circuitry for generating the qth digit of said quotient expressed by binary signals selected in accordance with a first of said plurality of encoding rules, said quotient determining circuitry having input thereto the three most significant digits of the (j)th partial remainder R(j) expressed in accordance with said first of said plurality of encoding rules; b) first circuitry for generating the most significant digit of the (j+1)th partial remainder R(j+1) expressed by binary signals selected in accordance with a first of said plurality of encoding rules, said first circuitry having input thereto the three most significant digits of the (j)th partial remainder R(j) expressed in accordance with said first of said plurality of encoding rules; c) second circuitry for generating the second most significant digit of the (j+1) th partial remainder R(j+1) expressed by binary signals selected in accordance with said first of said plurality of encoding rules, said second circuitry having input thereto binary signals representing the third significant digit of the (j)th partial remainder R(j) expressed in accordance with said second of said plurality of encoding rules: d) third circuitry for generating the third most significant digit of the (j+1)th partial remainder R(j+1) expressed by binary signals selected in accordance with said first of said plurality of encoding rules, said third circuitry having input thereto binary signals representing the fourth significant digit of the (j)th partial remainder R(j) expressed in accordance with said second of said plurality of encoding rules, said qth digit of said quotient, and the most significant digit of said divisor; and e) fourth circuitry for generating the fourth and subsequent digits of the (j+1)th partial remainder R(j+1) expressed by binary signals selected in accordance with said second of said plurality of encoding rules, said fourth circuitry having input thereto the fifth and subsequent digits from the (j)th partial remainder R(j) expressed by binary signals selected in accordance with said second of said encoding rules, said qth digit of said quotient and the second and subsequent digits of said divisor.
 3. An arithmetic processor having an adder tree for generating a final sum of a plurality of numbers, each of which is internally represented as a signed-digit number, said adder tree having a plurality of intermediate adder stages and a final adder stage, each adder stage having one or more adders for adding an augend and an addend pair, each pair being one of said plurality of numbers or a partial sum obtained as the result of an addition in a preceding intermediate adder stage, said augend and addend pair having an overlapping portion wherein the digits of said augend overlap digits of said addend and a non-overlapping portion caused by the augend being offset with respect to said addend, each of said intermediate adder stages comprising:(a) one or more first type adders each having first type logic circuitry for adding the digits of said augend and addend in said overlapping portion to generate part of said partial sum for application to an adder in a subsequent adder stage, generating a carry resulting from the addition of the highest order digits of said overlapping portion, and directly applying all of the higher order digits forming the non-overlapping portion to said subsequent adder stage to form part of the partial sum therein; and (b) a second type adder including second type logic circuitry for adding the digits of said augend and said addend in said overlapping portion to generate part of said partial sum for application to an adder in a subsequent adder stage, generating a carry resulting from the addition of the highest order digits of said overlapping portion, and adding zeros placed in the non-overlapping portions of the augend and any carries output from said first type adders of a proceeding stage to said higher order digits of said addend; said final adder stage of said adder tree including a second type adder for generating said final sum. 